Dynamic DAG Scheduling on Multiprocessor Systems: Reliability, Energy, and Makespan
نویسندگان
چکیده
منابع مشابه
Heterogeneous Energy and Makespan- Constrained DAG Scheduling
Energy-efficient resource allocation within computing systems is important because of the growing demand for, and cost of, energy. In this paper, we study the problem of energy-constrained static resource allocation of a collection of communicating tasks to a heterogeneous computing environment. Our goal is to maximize the probability (calculated via Monte Carlo method) that our collection of t...
متن کاملEnergy-efficient multiprocessor scheduling for flow time and makespan
We consider energy-efficient scheduling on multiprocessors, where the speed of each processor can be individually scaled, and a processor consumes power s if it runs at speed s, where α > 1. A scheduling algorithm needs to decide both processor allocations and speeds for a set of parallel jobs whose parallelism can vary with time. The objective is to minimize the sum of overall energy consumpti...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملMultiprocessor Scheduling of Dependent Tasks to Minimize Makespan and Reliability Cost Using NSGA-II
Algorithms developed for scheduling applications on heterogeneous multiprocessor system focus on a single objective such as execution time, cost or total data transmission time. However, if more than one objective (e.g. execution cost and time, which may be in conflict) are considered, then the problem becomes more challenging. This project is proposed to develop a multiobjective scheduling alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2020
ISSN: 0278-0070,1937-4151
DOI: 10.1109/tcad.2020.3013045